Adaptive routing with stale information
نویسندگان
چکیده
منابع مشابه
Adaptive Routing with Stale Information 1 , 2
We investigate the behaviour of load-adaptive rerouting policies in the Wardrop model where decisions must be made on the basis of stale information. In this model, an infinite number of agents controls an infinitesimal amount of flow each, thus contributing to a network flow which induces latency. In our dynamic extension of this model, agents are activated in a concurrent and asynchronous fas...
متن کاملInterpreting Stale Load Information
In this paper we examine the problem of balancing load in a large-scale distributed system when information about server loads may be stale. It is well known that sending each request to the machine with the apparent lowest load can behave badly in such systems, yet this technique is common in practice. Other systems use round-robin or random selection algorithms that entirely ignore load infor...
متن کاملInformed Trading When Information Becomes Stale
This paper characterizes informed trade when speculators can acquire distinct signals of varying quality about an asset’s value at different dates. The most reasonable characterization of private information about stocks is that while information is longlived, new information will arrive over time, information that may be acquired by others. Hence, while a speculator may know more than others a...
متن کاملEffective Stale Routes Management Using Preemptive Routing in DSR
Dynamic network topology is a major routing issue in MANETs, where effective management of the routes as the nodes move in and out of each other’s range is a mandatory requirement to reduce data packet loss, end to end delay and the network overhead. Routes are maintained in route cache by every node as they learn from forwarding data packets. While route cache has their own benefits of reducin...
متن کاملNetwork-Adaptive QoS Routing Using Local Information
In this paper, we propose the localized adaptive QoS routing scheme using POMDP(partially observable Markov Decision Processes) and Exploration Bonus. In order to deal with POMDP problem, we use CEA(Certainty Equivalency Approximation) technique that involves using the mean value of random variables, since it is intractable to determine the optimal solution. And we present a new path selection ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2009
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2008.01.055